Comments on "A Simple and Accurate Algorithm for Barycentric Rational Interpolation"
نویسنده
چکیده
First, I would like to thank the author of ”Comments on ’A Simple and Accurate Algorithm for Barycentric Rational Interpolation’” (hereafter referred to as ”the comments”) for their interest in my work [1]. The author of the comments points out a novel relationship between barycentric rational interpolation, the Welch-Berlekamp key equation and Gröbner bases. This could turn out to be a very promising novel approach for fast barycentric interpolation, since as to this author’s knowledge, the results about barycentric interpolation available in the literature (see references [13-17] in [1]) never mention the potential link with the Welch-Berlekamp key equation and/or Gröbner bases. However, the results in [1] with respect to the null space of a certain Löwner matrix have not been invalidated by the comments. As a last remark, it should be noted that the null space of a matrix can be calculated by other means than the SVD, e.g. by the ’cheaper’ QR decomposition.
منابع مشابه
Lebesgue Constant Minimizing Bivariate Barycentric Rational Interpolation
The barycentric form is the most stable formula for a rational interpolant on a finite interval. The choice of the barycentric weights can ensure the absence of poles on the real line, so how to choose the optimal weights becomes a key question for bivariate barycentric rational interpolation. A new optimization algorithm is proposed for the best interpolation weights based on the Lebesgue cons...
متن کاملSome New Aspects of Rational Interpolation
A new algorithm for rational interpolation based on the barycentric formula is developed; the barycentric representation of the rational interpolation function possesses various advantages in comparison with other representations such as continued fractions: it provides, e.g., information concerning the existence and location of poles of the interpolant.
متن کاملPyramid algorithms for barycentric rational interpolation
We present a new perspective on the Floater–Hormann interpolant. This interpolant is rational of degree (n, d), reproduces polynomials of degree d, and has no real poles. By casting the evaluation of this interpolant as a pyramid algorithm, we first demonstrate a close relation to Neville’s algorithm. We then derive an O(nd) algorithm for computing the barycentric weights of the Floater–Hormann...
متن کاملOn the Lebesgue constant of barycentric rational interpolation at equidistant nodes
Recent results reveal that the family of barycentric rational interpolants introduced by Floater and Hormann is very well-suited for the approximation of functions as well as their derivatives, integrals and primitives. Especially in the case of equidistant interpolation nodes, these infinitely smooth interpolants offer a much better choice than their polynomial analogue. A natural and importan...
متن کاملBarycentric-Remez algorithms for best polynomial approximation in the chebfun system
Variants of the Remez algorithm for best polynomial approximation are presented based on two key features: the use of the barycentric interpolation formula to represent the trial polynomials, and the setting of the whole computation in the chebfun system, where the determination of local and global extrema at each iterative step becomes trivial. The new algorithms make it a routine matter to co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEEE Signal Process. Lett.
دوره 17 شماره
صفحات -
تاریخ انتشار 2010